منابع مشابه
Inductive * -semirings See Back Inner Page for a List of Recent Brics Report Series Publications
One of the most well-known induction principles in computer science is the fixed point induction rule, or least pre-fixed point rule. Inductive ∗semirings are partially ordered semirings equipped with a star operation satisfying the fixed point equation and the fixed point induction rule for linear terms. Inductive ∗-semirings are extensions of continuous semirings and the Kleene algebras of Co...
متن کاملTropical Semirings
It is a well-known fact that the boolean calculus is one of the mathematical foundations of electronic computers. This explains the important role of the boolean semiring in computer science. The aim of this paper is to present other semirings that occur in theoretical computer science. These semirings were baptized tropical semirings by Dominique Perrin in honour of the pioneering work of our ...
متن کاملThermodynamic Semirings
The Witt construction describes a functor from the category of Rings to the category of characteristic 0 rings. It is uniquely determined by a few associativity constraints which do not depend on the types of the variables considered, in other words, by integer polynomials. This universality allowed Alain Connes and Caterina Consani to devise an analogue of the Witt ring for characteristic one,...
متن کاملSome Special Classes of Semirings and Ordered Semirings
In this paper, we study the properties of Semirings satisfyingthe identity a + ab = a. It is proved that, : Let (S , +, .) be a semiring which contains multiplicative identity 1, then a + ab = a for all a, b in S if and only if (S, + ) is absorbing.
متن کاملSeparability in Domain Semirings
First, we show with two examples that in test semirings with an incomplete test algebra a domain operation may or may not exist. Second, we show that two notions of separability in test semirings coincide, respectively, with locality of composition and with extensionality of the diamond operators in domain semirings. We conclude with a brief comparison of dynamic algebras and modal Kleene algeb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.03.050